A Rewriting Approach to Graph Invariants
نویسنده
چکیده
The Generic Diamond Lemma of the author is applied to the problem of classifying all graph invariants satisfying a contract–delete recursion (like that of the chromatic polynomial). As expected, the recursion for the Tutte polynomial is found, along with some more degenerate invariants. The purpose of this exercise is to demonstrate techniques for applying the diamond lemma to diagrammatic calculations in general. In addition, a concept of ‘semigraph’ is defined and some related elementary constructions of interest for algebraic applications are given.
منابع مشابه
Proving Invariants via Rewriting and Abstraction ∗
We present a deductive method for proving invariants of reactive systems. Our approach uses term rewriting to reduce invariant proofs to reachability analysis on a finite graph. This substantially automates invariant proofs by obviating the need to define inductive invariants while still benefitting from the expressiveness of deductive methods. We implement a procedure supporting this approach ...
متن کاملProving preservation of transitivity invariants in model transformations
This paper develops methods to reason about graph transformations, and in particular to show that transitivity and reachability invariants are preserved during transformations. In our approach, graph transformations consist of a pattern defining an applicability condition, and an operational description of the desired transformation. Whereas previous work was restricted to Boolean combinations ...
متن کاملApplications of some Graph Operations in Computing some Invariants of Chemical Graphs
In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007